Orthogonal representations of Steiner triple system incidence graphs
نویسندگان
چکیده
منابع مشابه
The watchman's walk of Steiner triple system block intersection graphs
A watchman’s walk in a graph G = (V,E) is a minimum closed dominating walk. In this paper, it is shown that the number of vertices in a watchman’s walk on the block intersection graph of a Steiner triple system is between v−3 4 and v−7 2 , for admissible v ≥ 15. Included are constructions to build a design that achieves the minimum bound for any admissible v.
متن کاملA Steiner triple system which colors all cubic graphs
We prove that there is a Steiner triple system T such that every simple cubic graph can have its edges coloured by points of T in such a way that for each vertex the colours of the three incident edges form a triple in T . This result complements the result of Holroyd and Škoviera that every bridgeless cubic graph admits a similar colouring by any Steiner triple system of order greater than 3. ...
متن کاملBicolour graphs of Steiner triple systems
In this paper we introduce the notion of a bicolour graph of a Steiner triple system. Given an arbitrary colouring of the points of a Steiner triple system, the bicolour graph is the graph obtained on the point set of the system by placing an edge between two points if they have the same colour and appear in a triple with a point of a di4erent colour. The case where the graph is Kv was partiall...
متن کاملBlock-Intersection Graphs of Steiner Triple Systems
A Steiner triple system of order n is a collection of subsets of size three, taken from the n-element set {0, 1, ..., n−1}, such that every pair is contained in exactly one of the subsets. The subsets are called triples, and a block-intersection graph is constructed by having each triple correspond to a vertex. If two triples have a non-empty intersection, an edge is inserted between their vert...
متن کاملRepresenting graphs in Steiner triple systems - II
Let G = (V,E) be a simple graph and let T = (P,B) be a Steiner triple system. Let φ be a one-to-one function from V to P . Any edge e = {u, v} has its image {φ(u), φ(v)} in a unique block in B. We also denote this induced function from edges to blocks by φ. We say that T represents G if there exists a one-to-one function φ : V → P such that the induced function φ : E → B is also one-to-one; tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2017
ISSN: 0012-365X
DOI: 10.1016/j.disc.2017.07.009